E-Voting System Using Homomorphic Encryption Technique

Secure Voting System Using Paillier Homomorphic Encryption

Design and Implementation of Secure Remote e-Voting System Using Homomorphic Encryption

Internet polling also known as “e-voting” became popular in past few years, since it reduces the tallying cost and time, increases the number of voter participation, also reduces the human resources and the traditional work that means less fraud and corruption. In this paper, a remote e-Voting system is designed and implemented using homomorphic encryption. The homomorphic property in ElGamal c...

Secure E-voting Using Homomorphic Technology

Voting is one of the most important activities in a democratic society. In a traditional voting environment voting process sometimes becomes quite inconvenient due to the reluctance of certain voters to visit a polling booth to cast votes besides involving huge social and human resources. The development of computer networks and elaboration of cryptographic techniques facilitate the implementat...

Multiplicative Homomorphic E-Voting

All the currently existing homomorphic e-voting schemes are based on additive homomorphism. In this paper a new e-voting scheme based on multiplicative homomorphism is proposed. In the tallying phase, a decryption is performed to recover the product of the votes, instead of the sum of them (as in the additive homomorphic e-voting schemes). Then, the product is factorized to recover the votes. T...

Efficient Receipt-Free Voting Based on Homomorphic Encryption

Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority voting protocol of Benaloh and Tuinstra and demonstrate that this protocol is not receiptfree, opposed to what was claimed in the paper and was believed before. Furthermore, we propose the first practicable receipt-fr...